Computing the greatest X-eigenvector of a matrix in max-min algebra

Computing the greatest X-eigenvector of a matrix in max-min algebra

Monotone interval eigenproblem in max-min algebra

Institute of Mathematics of the Academy of Sciences of the Czech Republic provides access to digitized documents strictly for personal use. Each copy of any part of this document must contain these Terms of use. This paper has been digitized, optimized for electronic delivery and stamped with digital signature within the project DML-CZ: The Czech Digital Mathematics Library The interval eigenpr...

Eigenspace of a circulant max-min matrix

Eigenvectors of a max-min matrix characterize stable states of the corresponding discrete-events system. Investigation of the max-min eigenvectors of a given matrix is therefore of a great practical importance. The eigenproblem in max-min algebra has been studied by many authors. Interesting results were found in describing the structure of the eigenspace, and algorithms for computing the maxim...

Max-min distance nonnegative matrix factorization

Nonnegative Matrix Factorization (NMF) has been a popular representation method for pattern classification problems. It tries to decompose a nonnegative matrix of data samples as the product of a nonnegative basis matrix and a nonnegative coefficient matrix. The columns of the coefficient matrix can be used as new representations of these data samples. However, traditional NMF methods ignore cl...

Iteration algorithm for solving Ax = b in max–min algebra

For solving the linear system A x = b we introduce some iteration algorithms, where A = (aij) and b = bi a given matrix and a column vector with elements from a Brouwerian lattice, and is a max–min composite operation. 2005 Elsevier Inc. All rights reserved.